On survivable network polyhedra
نویسندگان
چکیده
منابع مشابه
Two node-disjoint hop-constrained survivable network design and polyhedra
Given a weighted undirected graphGwith a set of pairs of terminals {si, ti}, i = 1, ..., d, and an integer L ≥ 2, the two node-disjoint hop-constrained survivable network design problem (TNHNDP) is to find a minimum weight subgraph of G such that between every si and ti there exist at least two node-disjoint paths of length at most L. This problem has applications to the design of survivable te...
متن کاملSurvivable Network Coding
Given a telecommunication network, modeled by a graph with capacities, we are interested in comparing the behavior and usefulness of two information propagation schemes, namely multicast and network coding, when the aforementioned network is subject to single arc failure. We consider the case with a single source node and a set of terminal nodes. The problem of studying the maximum quantity of ...
متن کاملSurvivable Virtual Network Embedding
Network virtualization can offer more flexibility and better manageability for the future Internet by allowing multiple heterogeneous virtual networks (VN) to coexist on a shared infrastructure provider (InP) network. A major challenge in this respect is the VN embedding problem that deals with the efficient mapping of virtual resources on InP network resources. Previous research focused on heu...
متن کاملOn capacitated network design cut-set polyhedra
This paper provides an analysis of capacitated network design cut–set polyhedra. We give a complete linear description of the cut–set polyhedron of the single commodity – single facility capacitated network design problem. Then we extend the analysis to single commodity – multifacility and multicommodity – multifacility capacitated network design problems. Valid inequalities described here are ...
متن کاملSurvivable Real-Time Network Services
This report covers the work done in support of the DARPA Information Technology Office program in computer networking. Contributors to this effort include Prof. David L. Mills, graduate student Harish Nair and undergraduate research student John Conner. MS student Tamal Basu has graduated and taken a position at Acorn Networks. Phd student Qiong Li has graduated and taken a position with Philli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2005
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.08.017